An Interactive Tuning Support for Processor Allocation of Data-Driven Realtime Programs

نویسندگان

  • Yasuhiro Wabiko
  • Hiroaki Nishikawa
چکیده

This paper presents the effectiveness of an interactive support facility to tune processor allocation of data-driven realtime programs on CUE (Coordinating Users’ requirements and Engineering constraints)-series super-integrated dynamic datadriven processors. In tuning processor allocation of data-driven programs on CUE processors, one of the most critical issues is how to detect and remove sideeffects on processor loads. Especially, in multiple processing of some streams, it must be clearly identified how a peak of instantaneous load convergence comes into existence and which portion of program causes the peak. The authors have been proposed a development environment named Realtime Execution System for CUE-series data-driven processors (RESCUE). CUE processors have ideal multi-processing capability without any interference among independent processes running simultaneously. Hence, the runtime performance of CUE processor can be predicted by static analysis of the program as long as pipeline hardware resources are not problems. This paper first proposes a support facility to tune processor allocation of a program to prevent overloaded status. This facility supports a user to clearly know how the peak of load comes existence to identify which portion of program causes the peak. Then a user can change processor allocation of a portion of program using this facility. This paper then preliminary evaluates this facility by applying this facility to tune a realtime image processing program as an practical example. As a result, this paper shows that this facility can support not only detection of the bottleneck of a realtime system based on CUE processors, but also tuning of CUE processor architecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximizing Speedup through Self-Tuning of Processor Allocation - Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International

We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of processor allocations is important because many parallel applications exhibit peak speedups at allocations that are data or time dependent. We propose the use of a runtime system that: (a) dynamically measures job eficie...

متن کامل

A Model-Driven Decision Support System for Software Cost Estimation (Case Study: Projects in NASA60 Dataset)

Estimating the costs of software development is one of the most important activities in software project management. Inaccuracies in such estimates may cause irreparable loss. A low estimate of the cost of projects will result in failure on delivery on time and indicates the inefficiency of the software development team. On the other hand, high estimates of resources and costs for a project wil...

متن کامل

An Interactive Allocation for Depot-Customer-Depot in a Multi Aspect Supply Chain Network

Supply chain excellence has a real huge impact on business strategy. Building supply chains (SCs) as flexible system represents one of the most exciting opportunities to create value. This requires integrated decision making amongst autonomous chain partners with effective decision knowledge sharing among them. The key to success lies in knowing which decision has more impact on the supply chai...

متن کامل

Maximizing Speedup through Self-Tuning of Processor Allocation

We address the problem of maximizing the speedup of an individual parallel job through the selection of an appropriate number of processors on which to run it. If a parallel job exhibits speedup that increases monotonically in the number of processors, the solution is clearly to make use of all available processors. However, many applications do not have this characteristic: they reach a point ...

متن کامل

Methods of Parallel Experimental Design of Online Automatic Tuning and their Application to Parallel Sparse Matrix Data Structure

Automatic tuning is one of key technologies in high performance computing, where parallel processing is essential. In this paper, we propose some methods of parallel experimental design for online automatic tuning of parallel programs. In parallel processing, two kinds of tuning should be investigated. One is local tuning, which optimizes local tuning parameters on each processor, and the other...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003